Minimal Flat Knotted Ribbons
نویسنده
چکیده
This paper gives mathematical models for flat knotted ribbons, and makes specific conjectures for the least length of ribbon (for a given width)) needed to tie the trefoil knot and the figure eight knot. The first conjecture states that (for width one) the least length of ribbon needed to tie an open-ended trefoil knot is
منابع مشابه
Many, Many More Intrinsically Knotted Graphs
We list more than 200 new examples of minor minimal intrinsically knotted graphs and describe many more that are intrinsically knotted and likely minor minimal.
متن کاملInterplay between symmetry and spin-orbit coupling on graphene nanoribbons
We study the electronic structure of chiral and achiral graphene nanoribbons with symmetric edges, including curvature and spin-orbit effects. Curved ribbons show spin-split bands, whereas flat ribbons present spin-degenerate bands. We show that this effect is due to the breaking of spatial inversion symmetry in curved graphene nanoribbons, while flat ribbons with symmetric edges possess an inv...
متن کاملCurling graphene ribbons through thermal annealing
A simple process is developed to curl graphene membranes through thermal annealing. The resulting curled graphene ribbons displayed enhanced photocurrent response compared to flat graphene ribbons. The annealing temperature, the thickness of the graphene, and the type of polymethyl methacrylate used were the three key factors that influenced the morphology of graphene during thermal annealing. ...
متن کاملA Knotted Minimal Tree
There is a finite set of points on the boundary of the three-dimensional unit ball whose minimal tree is knotted. This example answers a problem posed by Michael Freedman.
متن کاملOn strongly almost trivial embeddings of graphs
An algorithm for detecting intrinsically knotted graphs, yielding many new minor minimal IK graphs. Ramin Naimi Occidental College We describe an algorithm that detects seemingly most (and possibly all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. We have used this algorithm, implemented as a Mathematica program, to find many new minor min...
متن کامل